Discrete Optimization Problems of Linear Array Synthesis by Using Real Number Par- Ticle Swarm Optimization

نویسندگان

  • D. Liu
  • Q.-Y. Feng
  • W.-B. Wang
چکیده

It is generally believed genetic algorithm (GA) is superior to particle swarm optimization (PSO) while dealing with the discrete optimization problems. In this paper, a suitable mapping method is adopted and the modified PSO can effectively deal with the discrete optimization problems of linear array pattern synthesis. This strategy has been applied in thinned linear array pattern synthesis with minimum sidelobe level, 4-bit digital phase shifter linear array pattern synthesis and unequally spaced thinned array pattern synthesis with minimum sidelobe level. The obtained results are all superior to those in existing literatures with GA, iterative FFT and different versions of binary PSO, that show the effectiveness of this strategy and its potential application to other discrete electromagnetic optimization problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Digitally Excited Reconfigurable Linear Antenna Array Using Swarm Optimization Algorithms

This paper describes the synthesis of digitally excited pencil/flat top dual beams simultaneously in a linear antenna array constructed of isotropic elements. The objective is to generate a pencil/flat top beam pair using the excitations generated by the evolutionary algorithms. Both the beams share common variable discrete amplitude excitations and differ in variable discrete phase excitations...

متن کامل

Comparative Study of Particle Swarm Optimization and Genetic Algorithm Applied for Noisy Non-Linear Optimization Problems

Optimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) seem very efficient to approach in these problems and became very popular. The efficiency of these ...

متن کامل

IMPROVING COMPUTATIONAL EFFICIENCY OF PARTICLE SWARM OPTIMIZATION FOR OPTIMAL STRUCTURAL DESIGN

This paper attempts to improve the computational efficiency of the well known particle swarm optimization (PSO) algorithm for tackling discrete sizing optimization problems of steel frame structures. It is generally known that, in structural design optimization applications, PSO entails enormously time-consuming structural analyses to locate an optimum solution. Hence, in the present study it i...

متن کامل

A Thinning Method of Linear And Planar Array Antennas To Reduce SLL of Radiation Pattern By GWO And ICA Algorithms

In the recent years, the optimization techniques using evolutionary algorithms have been widely used to solve electromagnetic problems. These algorithms use thinning the antenna arrays with the aim of reducing the complexity and thus achieving the optimal solution and decreasing the side lobe level. To obtain the optimal solution, thinning is performed by removing some elements in an array thro...

متن کامل

Optimal Reconfiguration of Solar Photovoltaic Arrays Using a Fast Parallelized Particle Swarm Optimization in Confront of Partial Shading

Partial shading reduces the power output of solar modules, generates several peak points in P-V and I-V curves and shortens the expected life cycle of inverters and solar panels. Electrical array reconfiguration of PV arrays that is based on changing the electrical connections with switching devices, can be used as a practical solution to prevent such problems. Valuable studies have been perfor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012